From Mathematical Functions to Syntax
ثبت نشده
چکیده
@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer Science}, pages={223--255}, year=1977 } Summary: Plotkin investigates the relation between the denotational and the operational semantics of a programming language. As a working example, he picks PCF a language based on Scott’s Logic of Computable Functions. He demonstrates that even though denotational and operational semantics are in agreement when it comes to how they map PCF programs to their results, elements of the denotational space cannot be expressed as PCF function definitions. Thus the equality of functions in the denotational space is different to contextual equivalence. Evaluation: This is a seminal paper. It is the first result on the relation between denotational and syntactic approaches to the semantics of programming languages. Moreover, it introduces the two fundamental properties that determine this relation: adequacy and full abstraction. Establishing the latter remained an open problem for PCF for more than a decade leading to a significant body of results including the invention of game semantics. Finally PCF itself has become an established and popular model of programming languages.
منابع مشابه
The application and development of graph theory through the space syntax method: The implementation of analytical practical model in architecture
Abstract Over the last few decades, different mathematical methods have been used to design and analyze architectural spaces. Meanwhile, the graph theory provides an abstract model to study the spatial configuration, so that a simple and flexible mathematical framework is obtained to analyze the spatial topological features and their relationship with social and functional concepts in architec...
متن کاملBeyond first order logic: From number of structures to structure of numbers: Part II
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This second part continues to study the question of catecoricitytrans...
متن کاملBeyond First Order Logic: From number of structures to structure of numbers: Part I
We study the history and recent developments in nonelementarymodel theory focusing on the framework of abstractelementary classes. We discuss the role of syntax and semanticsand the motivation to generalize first order model theory to nonelementaryframeworks and illuminate the study with concrete examplesof classes of models. This first part introduces the main conceps and philosophies anddiscu...
متن کاملDescription Theory and Approach about Space Syntax Methodology in Urban Design Process
Nowadays space is considered to be a net of connections between different areas. The questions how to delineate its character and how it is possible to objectively compare two spaces is a matter under consideration. This was the reason for creating new theories about the structure of space. Space syntax analysis (SSA) or simply Space Syntax defines a number of theories and research areas devo...
متن کاملThe Formalization of Syntax-Based Mathematical Algorithms Using Quotation and Evaluation
Algorithms like those for differentiating functional expressions manipulate the syntactic structure of mathematical expressions in a mathematically meaningful way. A formalization of such an algorithm should include a specification of its computational behavior, a specification of its mathematical meaning, and a mechanism for applying the algorithm to actual expressions. Achieving these goals r...
متن کامل